Estimating convexifiers in continuous optimization
نویسندگان
چکیده
Every function of several variables with the continuous second derivative can be convexified (i.e., made convex) by adding to it a quadratic “convexifier”. In this paper we give simple estimates on the bounds of convexifiers. Using the idea of convexification, many problems in applied mathematics can be reduced to convex mathematical programming models. This is illustrated here for nonlinear programs and systems of nonlinear equations.
منابع مشابه
A Novel Intelligent Water Drops Optimization Approach for Estimating Global Solar Radiation
Normal 0 false false false EN-US X-NONE AR-SA MicrosoftInternetExplorer4 Measurement of solar radiance demands expensive devices to be used. Alternatively, estimator models are used instead. In this paper, a new method based on the empirical equations is introduced to estimate the monthly average daily global solar radiation on a horizontal surface. The proposed method uses Intelligent Water ...
متن کاملContinuous Discrete Variable Optimization of Structures Using Approximation Methods
Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...
متن کاملA System for Continuous Estimating and Monitoring Cardiac Output via Arterial Waveform Analysis
Background: Cardiac output (CO) is the total volume of blood pumped by the heart per minute and is a function of heart rate and stroke volume. CO is one of the most important parameters for monitoring cardiac function, estimating global oxygen delivery and understanding the causes of high blood pressure. Hence, measuring CO has always been a matter of interest to researchers and clinicians. Sev...
متن کاملA Continuous Optimization Model for Partial Digest Problem
The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simp...
متن کاملDISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM
Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...
متن کامل